Interactive segmentation based on component-trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive segmentation based on component-trees

Component-trees associate to a discrete gray-level image a descriptive data structure induced by the inclusion relation between the binary components obtained at successive level-sets. This article presents an interactive segmentation methodology based on component-trees. It consists of the extraction of a subset of the image component-tree, enabling the generation of a binary object which fits...

متن کامل

Edge-based Component-Trees for Multi-Channel Image Segmentation

We introduce the concept of edge-based component-trees for images with an arbitrary number of channels. The approach is a natural extension of the classical component-tree devoted to gray-scale images. The similar structure enables the translation of many gray-level image processing techniques based on the componenttree to hyperspectral and color images. As an example application, we present an...

متن کامل

Learning Based Interactive Image Segmentation

I n this paper we present a n approach, to image segmentation in which user selected sets of examples and counter-examples supply information about the specific segmentation problem. Image segmentation is guided by a genetic algorithm which learns the appropriate subset and spatial combination of a collection of discriminating functions, associated with image features. The genetic algorithm enc...

متن کامل

Heterogeneous Redundancy Analysis based on Component Dynamic Fault Trees

The aggregation of hardware components to add recovery capabilities to a system function may result in high costs. Instead of adding redundancies with homogeneous nature aimed at providing recovery capabilities to a predefined system function, there is room in some scenarios to take advantage of over-dimensioning design decisions and overlapping structural functions using heterogeneous redundan...

متن کامل

Component-based decision trees for classification

Typical data mining algorithms follow a so called “black-box” paradigm, where the logic is hidden from the user not to overburden him. We show that “white-box” algorithms constructed with reusable components design can have significant benefits for researchers, and end users as well. We developed a component-based algorithm design platform, and used it for “white-box” algorithm construction. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition

سال: 2011

ISSN: 0031-3203

DOI: 10.1016/j.patcog.2011.03.025